Structure-Function Network Mapping and Its Assessment via Persistent Homology

نویسندگان

  • Hualou Liang
  • Hongbin Wang
چکیده

Understanding the relationship between brain structure and function is a fundamental problem in network neuroscience. This work deals with the general method of structure-function mapping at the whole-brain level. We formulate the problem as a topological mapping of structure-function connectivity via matrix function, and find a stable solution by exploiting a regularization procedure to cope with large matrices. We introduce a novel measure of network similarity based on persistent homology for assessing the quality of the network mapping, which enables a detailed comparison of network topological changes across all possible thresholds, rather than just at a single, arbitrary threshold that may not be optimal. We demonstrate that our approach can uncover the direct and indirect structural paths for predicting functional connectivity, and our network similarity measure outperforms other currently available methods. We systematically validate our approach with (1) a comparison of regularized vs. non-regularized procedures, (2) a null model of the degree-preserving random rewired structural matrix, (3) different network types (binary vs. weighted matrices), and (4) different brain parcellation schemes (low vs. high resolutions). Finally, we evaluate the scalability of our method with relatively large matrices (2514x2514) of structural and functional connectivity obtained from 12 healthy human subjects measured non-invasively while at rest. Our results reveal a nonlinear structure-function relationship, suggesting that the resting-state functional connectivity depends on direct structural connections, as well as relatively parsimonious indirect connections via polysynaptic pathways.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Assessment of geostatistical and interpolation methods for mapping forest dieback intensity in Zagros forests

During recent years, oak decline has been widely spread across Brant’s oak (Quercus Brantii Lindl.) stands in the Zagros Mountains, Western Iran, which caused large-area forest dieback in several sites. Mapping the intensity and spatial distribution of forest dieback is essential for developing management and control strategies. This study evaluated a range of geostatistical and interpolation m...

متن کامل

Relation Between RNA Sequences, Structures, and Shapes via Variation Networks

Background: RNA plays key role in many aspects of biological processes and its tertiary structure is critical for its biological function. RNA secondary structure represents various significant portions of RNA tertiary structure. Since the biological function of RNA is concluded indirectly from its primary structure, it would be important to analyze the relations between the RNA sequences and t...

متن کامل

Persistent Path Homology of Directed Networks Samir Chowdhury and Facundo

While standard persistent homology has been successful in extracting information from metric datasets, its applicability to more general data, e.g. directed networks, is hindered by its natural insensitivity to asymmetry. We study a construction of homology of digraphs due to Grigor’yan, Lin, Muranov and Yau, and extend this construction to the persistent framework. The result, which we call pe...

متن کامل

In silico Homology Modeling and Epitope Prediction of NadA as a Potential Vaccine Candidate in Neisseria meningitidis

Neisseria meningitidis is a facultative pathogen bacterium which is well founded with a number of adhesion molecules to facilitate its colonization in human nasopharynx track. Neisseria meningitidis is a major cause of mortality from sever meningococcal disease and septicemia. The Neisseria meningitidis adhesion, NadA, is a trimeric autotransporter adhesion molecule which is involved in cell ad...

متن کامل

Adversary Detection in Neural Networks via Persistent Homology

We outline a detection method for adversarial inputs to deep neural networks. By viewing neural network computations as graphs upon which information flows from input space to output distribution, we compare the differences in graphs induced by different inputs. Specifically, by applying persistent homology to these induced graphs, we observe that the structure of the most persistent subgraphs ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2017